Search Results/Filters    

Filters

Year

Banks




Expert Group










Full-Text


Author(s): 

MAKANI A. | BOUAZIZ R.

Issue Info: 
  • Year: 

    2010
  • Volume: 

    2
  • Issue: 

    1
  • Pages: 

    0-0
Measures: 
  • Citations: 

    1
  • Views: 

    135
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 135

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2024
  • Volume: 

    54
  • Issue: 

    1
  • Pages: 

    99-110
Measures: 
  • Citations: 

    0
  • Views: 

    37
  • Downloads: 

    15
Abstract: 

Efficient distribution of service requests between fog and cloud nodes considering user mobility and fog nodes’ overload is an important issue of fog computing. This paper proposes a heuristic method for Task placement considering the mobility of users, aiming to serve a higher number of requested services and minimize their response time. This method introduces a formula to overload prediction based on the entry-exit ratio of users and the estimated time required to perform current requests that are waiting in the queue of a fog node. Then, it provides a solution to avoid the predicted overloading of fog nodes by sending all delay-tolerant requests in the overloaded fog node’s queue to the cloud to reduce the time required for servicing delay-sensitive requests and to increase their acceptance rate. In addition, to prevent requests from being rejected when the mobile user leaves the coverage area of the current fog node, the requests in the current fog node’s queue will be transferred to the destination fog node. Simulation results indicate that the proposed method is effective in avoiding the overloading of the fog nodes and outperforms the existing methods in terms of response time and acceptance rate.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 37

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 15 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2019
  • Volume: 

    17
  • Issue: 

    57
  • Pages: 

    159-172
Measures: 
  • Citations: 

    0
  • Views: 

    684
  • Downloads: 

    0
Abstract: 

Today, business process management systems (BPMS) are rapidly expanding. Organizations and corporations need to leverage BPMS to manage their business processes and to increase economic productivity for competing in the international market. Therefore, researchers are to increase the features of BPMS. Workload balancing in BPMS is one of the challenges which have been studied by researchers. The purposes of workload balancing include increasing system stability, improving the resource efficiency and enhancing the quality of its products. In this paper, undesirable effects of the time delay of arrival rate in the Tasks are presented. To overcome the undesirable effects, we define the workload pattern of resources and we propose a heuristic method to manage and regulate the processes in the BPMS as Process Concurrency. we leverage PSO algorithm to optimize process Concurrency. Therefore, in addition to balancing the workload of resources, workload for each resource is maintained uniform through time. Creating uniformity in workload, as a result, increase the resource efficiency and improve the quality of products and services. To evaluate the proposed method, experimental results showed the optimal process Concurrency 29. 8% increase balance and uniformity in the resource workload.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 684

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2013
  • Volume: 

    4
  • Issue: 

    2 (12)
  • Pages: 

    63-73
Measures: 
  • Citations: 

    0
  • Views: 

    309
  • Downloads: 

    112
Abstract: 

The large number of applications manages time varying data. Existing database technology seldom supports temporal database, TDB, according to time aspects. These intrinsic temporal database applications rely on such database which stores and retrieves time referenced data. Moreover, applications need to be managed on common data items access simultaneously and to be precluded from inconsistency as soon as possible which is the main Task of Concurrency controller or CC in short. The method used by CC in typical DB differs from its attitude with TDB. The variety algorithms were proposed regarding to TDB properties by reduction of granule size and decreasing the rate of conflicts to satisfy good performance, but none of them has achieved robust results. There are two categories of CC such as pessimistic and optimistic. In this paper new approach, with considering the TDB aspects, based on optimistic method has been suggested. It reclines the size of granule as data item appropriately and recognizes the conflicts swiftly. Consequently, we compare our proposed algorithm with pervasive 2PL-pessimistic approach. The outcome shows that new proposed algorithm has high degree of trade off with satisfying near conflict time detection and high rate of parallelism metrics.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 309

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 112 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 6
Issue Info: 
  • Year: 

    2009
  • Volume: 

    -
  • Issue: 

    -
  • Pages: 

    327-351
Measures: 
  • Citations: 

    1
  • Views: 

    153
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 153

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2006
  • Volume: 

    -
  • Issue: 

    10
  • Pages: 

    0-0
Measures: 
  • Citations: 

    1
  • Views: 

    106
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 106

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2019
  • Volume: 

    10
  • Issue: 

    1
  • Pages: 

    117-145
Measures: 
  • Citations: 

    0
  • Views: 

    743
  • Downloads: 

    0
Abstract: 

Although, Fertility or the process of child bearing is a main and principal pillar of demography, but simultaneously, as a social phenomenon, it has a close relation to the culture and especially to the socio-economic feature as well as to macro policies of countries. Therefore, socio-economic and cultural policies and plans have considerable effect on fertility and reciprocally are affected by it. In other word, fertility, being a main factor of population change, also carries an important cultural element. Meanwhile, citizens of any country after moving to other countries still preserve their own culture, traditions and behaviors for many years and in some cases for whole their lives. However, available data indicates that fertility level is an exception and gradually tends to that of host country. In this study, to examine this hypothesis, an Iranian national fertility trend was compared with that of Afghan immigrants. Results of this comparison showed that: the level of fertility among Afghan immigrants has a remarkable tendency to that of Iranian national level, while gradually deferring from their own national level. Therefore, a Concurrency between fertility and cultural changes was approved. This finding was then explained using “ Nudge” theory and resulted in an outcome justified by theories of fertility explanation.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 743

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

Haqiqat Seyyed Sadiq

Journal: 

AYENEH-YE-PAZHOOHESH

Issue Info: 
  • Year: 

    2021
  • Volume: 

  • Issue: 

  • Pages: 

    5-37
Measures: 
  • Citations: 

    0
  • Views: 

    221
  • Downloads: 

    0
Abstract: 

In the field of Islamic political thought, Concurrency of political philosophy and political jurisprudence can be proposed; in Concurrency theory, the main emphasis is on the relationship between political philosophy and political jurisprudence. The three levels that are less emphasized here are the methodological level, the epistemological level, and the relationship between tradition and modernity. The claim at the epistemological level is that reason, narration, experience, intuition, and history do not contradict each other, and they ultimately pursue a single goal. This article tries to present Concurrency as a "theory" in the field of Islamic political thought. "Theory" is an organized set of concepts and propositions whose components are united in order to explain things, and prove a single claim. In this case, theory is regular expressions of social realities based on logical systems that exist in a science or school. Andrew sees other theories as a way of regulating the relationship between observations (or data) whose meaning is definite. According to the theory of concurrence, here, the claim can be made that "although political philosophy, by definition, is independent of revelation, but to study political issues from the perspective of Islam, we need both a philosophical answer and a jurisprudential answer. ». In other words, not only can political philosophy and political jurisprudence answer political questions separately, but the answers to the two will also be comparable. In fact, the claim is that in order to solve political problems from the Islamic point of view, we need a philosophical answer, a jurisprudential answer, and a comparison of the two. Of course, the validity of political jurisprudence faces certain limitations. Concurrency theory informs of fact and something situational; In other words, the relationship between the two sciences of political philosophy and political jurisprudence is reached. This does not contradict the normative and prescriptive dimensions of this theory. For example, based on this theory, it can be said that a political scientist should first and foremost raise any issue in these two areas; And then it is "necessary" to relate the results obtained in these two areas. The author has done this regarding the distribution of power in Shiite political thought.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 221

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2016
  • Volume: 

    5
Measures: 
  • Views: 

    227
  • Downloads: 

    183
Abstract: 

RUN CONCURRENT TRANSACTIONS IN A DATABASE MANAGEMENT SYSTEM MAY RESULT IN INCONSISTENCY. INCONSISTENCY IS AS THE RESULT OF INCORRECT VALUES THAT IS CREATED FOR DATA AVAILABLE AS A RESULT OF CONFLICT AND INTERFERENCE IN RUNNING TRANSACTIONS. Concurrency CONTROL ALGORITHMS TO ENSURE CONCURRENT RUNNING OF MULTIPLE TRANSACTIONS ARE DESIGNED THAT WORK CONCURRENTLY WITH SHARED DATA. A GREAT DEAL OF RESEARCH HAS BEEN DONE IN THE FIELD OF DATABASE Concurrency CONTROL, WHICH RESULTS IN VARIOUS Concurrency CONTROL ALGORITHMS. A LOT OF STUDIES CAN BEEN DONE IN THE AREA OF EVALUATING Concurrency CONTROL ALGORITHMS DUE TO VARIOUS ALGORITHMS IN THIS AREA AND THE FACT THAT ITS IMPORTANCE WILL INCREASE DAY BY DAY. IN THIS PAPER, FIRSTLY BASIC TWO-STAGE LOCKING Concurrency CONTROL ALGORITHMS AS WELL AS TECHNIQUES OF WOUND - WAIT AND WAIT - DIE MODELED THAT INCLUDING THE TECHNIQUES OF PREVENTING DEADLOCK. SINCE THE COLORED PETRI NET HAVE HIGH MODELING CAPABILITIES AND ONE OF THE BEST WAYS TO ANALYZE THE Concurrency CONTROL MECHANISMS; SO THAT MODELING WERE PROVIDED USING COLORED PETRI AND CPN TOOLS. A SIMPLE CASE STUDY WAS PRESENTED AS AN EXAMPLE TO BETTER UNDERSTAND WHICH INCLUDE THREE TRANSACTION AND TWO SOURCES. EVALUATION BASED ON THE PARAMETERS AND CRITERIA SUCH AS NUMBER OF TRANSACTIONS ENTERED INTO THE SYSTEM, THE NUMBER OF ORDERS FOR EACH TRANSACTION, THE NUMBER OF COMMON AND NON-COMMON DATA BETWEEN THE TRANSACTIONS AND THE NUMBER OF COMMON DATA IN TRANSACTIONS WITHOUT NON-COMMON DATA HAD TAKEN PLACE. BY COMPARING AND CONDUCTING SURVEYS, IT TURNED OUT THAT IN GENERAL, WOUND- WAIT ALGORITHM HAD BETTER RUNNING TIME COMPARED TO OTHER TWO ALGORITHMS. WAIT- DIE ALGORITHM IN TERMS OF RUN TIME WITH A LARGE DIFFERENCE WAS IN WORSE LEVEL COMPARED TO THE OTHER TWO ALGORITHMS AND BASIC TWO-PHASE LOCKING ALGORITHM DUE TO THE OCCURRENCE OF DEADLOCK HAD MANY PROBLEMS.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 227

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 183
Issue Info: 
  • Year: 

    2018
  • Volume: 

    15
  • Issue: 

    2 (SERIAL 36)
  • Pages: 

    103-117
Measures: 
  • Citations: 

    0
  • Views: 

    809
  • Downloads: 

    0
Abstract: 

Business process management systems (BPMS) are vital complex information systems to compete in the global market and to increase economic productivity. Workload balancing of resources in BPMS is one of the challenges have been long studied by researchers. Workload balancing of resources increases the system stability, improves the efficiency of the resources and enhances the quality of their products. Workload balancing of resources in BPMS is considered as an important factor of the performance and the stability in systems. Setting the workload of each source at a certain level increases the efficiency of the resources. The main objectives of this research are the concept of resource workload balance and uniformity of the workload for each source at a specified level. To optimize the balance workload and uniformity of each source, the ​ ​ setting multi-process Concurrency was offered and studied. Also, the regulation of multi-process Concurrency was mentioned as an optimization problem. In this paper, tuning Concurrency of the business process is introduced as a problem in BPMS, which is an application issue to improve at workload balance of resources and uniformity in the workload of each resource. To solve this problem, a delay vector is defined, each element of delay vector makes the synthetic delay at the first of each business process, then a dynamic optimization algorithm is presented to compute delay vector and the speed of the proposed algorithms is compared with and state-space search algorithm and evolutionary algorithm of PSO. The comparison shows that the speed of the proposed algorithm is 37 hours to 5. 8 years compared to the state-space search algorithm, while the POS algorithm solves the same problem in just 3 minutes. The experimental results on a real dataset show 21. 64 percent improvement in the performance of the proposed algorithm.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 809

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button